The Impact of Correlated Link Weights on QoS Routing
نویسندگان
چکیده
Finding a path in a network based on multiple constraints (the MCP problem) is often referred to as QoS routing. QoS routing with constraints on multiple additive metrics has been proven to be NP-complete. This proof has dramatically inßuenced the research community, resulting into the common belief that exact QoS routing is intractable in practice. Hence, many heuristics for this problem were proposed, while hardly any exact algorithms. However, to our best knowledge, no one has ever examined which worst-cases cause NP-complete behavior. In fact, the MCP problem is not strong NP-complete, suggesting that in practice an exact QoS algorithm may work in polynomial time, making guaranteed QoS routing possible. The goal of this paper is to provide some properties and simulation results that indicate that NP-complete behavior hinges on a speciÞc correlation structure between the link weights, which will be hardly ever encountered in practice.
منابع مشابه
Evolutionary Computing Assisted Wireless Sensor Network Mining for QoS-Centric and Energy-efficient Routing Protocol
The exponential rise in wireless communication demands and allied applications have revitalized academia-industries to develop more efficient routing protocols. Wireless Sensor Network (WSN) being battery operated network, it often undergoes node death-causing pre-ma...
متن کاملImproving Quality of Service Routing in Mobile Ad Hoc Networks Using OLSR
Mobile ad hoc networks (MANET) are constructed by mobile nodes without access point. Since MANET has certain constraints, including power shortages, an unstable wireless environment and node mobility, more power-efficient and reliable routing protocols are needed. The OLSR protocol is an optimization of the classical link state algorithm. OLSR introduces an interesting concept, the multipoint r...
متن کاملAdvanced operations research techniques for multi-constraint QoS routing in internet
Internet Traffic has grown exponentially over last few years due to provision of multiple class services through Internet backbone. With the explosive use of Internet, contemporary Internet routers are susceptible to overloads and their services deteriorate drastically and often cause denial of services. In this paper, an analysis is made how forecasting technique, routing algorithm and Genetic...
متن کاملOn the complexity of QoS routing
We present SAMCRA, an exact QoS routing algorithm that guarantees to Þnd a feasible path if such a path exists. Because SAMCRA is an exact algorithm, its complexity also characterizes that of QoS routing in general. The complexity of SAMCRA is simulated in speciÞc classes of graphs. Since the complexity of an algorithm involves a scaling of relevant parameters, the second part of this paper ana...
متن کاملImpact of Resource Reservation on the Distributed Multi–path Quality of Service Routing Scheme
This paper studies the impact of resource reservation on the multi–path Quality–of–Service (QoS) routing schemes that use global network state to make routing decisions. Incorporating resource reservation into multi–path QoS routing algorithms greatly changes the communication characteristics in a network system and affects the performance of the routing algorithms. In this paper, we develop a ...
متن کامل